Fast Approximation Algorithms for Fractional Packing and Covering Problems
نویسندگان
چکیده
منابع مشابه
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Thii paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniiues. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a ...
متن کاملApproximation Algorithms for Mixed Fractional Packing and Covering Problems
We propose an approximation algorithm based on the Lagrangian or price directive decomposition method to compute an -approximate solution of the mixed fractional packing and covering problem: find x 2 B such that f(x) (1 + )a, g(x) (1 )b where f(x); g(x) are vectors with M nonnegative convex and concave functions, a and b are M dimensional nonnegative vectors and B is a convex set that can be q...
متن کاملApproximation Algorithms for Covering and Packing Problems on Paths
Routing and scheduling problems are fundamental problems in combinatorial optimization, and also have many applications. Most variations of these problems are NP-Hard, so we need to use heuristics to solve these problems on large instances, which are fast and yet come close to the optimal value. In this thesis, we study the design and analysis of approximation algorithms for such problems. We f...
متن کاملFaster approximation algorithms for packing and covering problems∗
We adapt a method proposed by Nesterov [19] to design an algorithm that computes optimal solutions to fractional packing problems by solving O∗( −1 √ Kn) separable convex quadratic programs, where K is the maximum number of non-zeros per row and n is the number of variables. We also show that the quadratic program can be approximated to any degree of accuracy by an appropriately defined piecewi...
متن کاملApproximation algorithms for covering/packing integer programs
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min{cx : x ∈ Z+, Ax ≥ a, Bx ≤ b, x ≤ d}. We give a bicriteria-approximation algorithm that, given ε ∈ (0, 1], finds a solution of cost O(ln(m)/ε) times optimal, meeting the covering constraints (Ax ≥ a) and multiplicity constraints (x ≤ d), and satisfying Bx ≤ (1 + ε)b + β, wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1995
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.20.2.257